A Single Formula and its Implementation in FPGA for Elliptic Curve Point Addition Using Affine Representation

نویسندگان

  • Miguel Morales-Sandoval
  • Claudia Feregrino Uribe
  • René Cumplido
  • Ignacio Algredo-Badillo
چکیده

A formula for point addition in elliptic curves using a±ne representation and its implementation in FPGA is presented. The use of this new formula in hardware implementations of scalar multiplications for elliptic curve cryptography has the main advantages of: (i) reducing area for the implementations of elliptic curve point addition, and (ii) increasing the resistance to side channel attacks of the hardware implementation itself. Hardware implementation of scalar multiplication for elliptic curve cryptography using this new formulation requires low area resources while keeping high performance compared to implementations using projective coordinates, which are usually considered faster than the a±ne coordinates.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient elliptic curve cryptosystems

Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...

متن کامل

VHDL Implementation using Elliptic Curve Point Multiplication

This paper describes synthesizable VDHL implementation of elliptic curve Point Multiplication. Elliptic curves used for ECC are defined over mathematical structures called Galois fields. Based on the theory of ECC, this paper has carried out Modular addition/subtraction, EC Point doubling/addition, Modular multiplicative inversion, EC point multiplier, projective to affine coordinates conversio...

متن کامل

On the Implementation of Unified Arithmetic on Binary Huff Curves

Unified formula for computing elliptic curve point addition and doubling are considered to be resistant against simple power-analysis attack. A new elliptic curve formula known as unified binary Huff curve in this regard has appeared into the literature in 2011. This paper is devoted to analyzing the applicability of this elliptic curve in practice. Our paper has two contributions. We provide a...

متن کامل

Design and Implementation of Ec Based Cryptosystem on Fpga

As computing and communication devices are equipped with increasingly versatile wireless connection capabilities, the demand for security increases. Cryptography provides a method for securing and authenticating the transmission of information over the insecure channels. Elliptic Curve [EC] Cryptography is a public key cryptography which replaces RSA because of its increased security with lesse...

متن کامل

An FPGA implementation of elliptic curve cryptography for future secure web transaction

Elliptic curve cryptography (ECC) is an alternative to traditional techniques for public key cryptography. It offers smaller key size without sacrificing security level. In a typical elliptic curve cryptosystem, elliptic curve point multiplication is the most computationally expensive component. So it would be more attractive to implement this unit using hardware than using software. In this pa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Journal of Circuits, Systems, and Computers

دوره 19  شماره 

صفحات  -

تاریخ انتشار 2010